An Advanced Codebook Background Model Using Confidence and Membership Function
نویسندگان
چکیده
This paper introduces an advanced codebook model for foreground-background segmentation. The improvement is two-fold. First, to cope with changing global lumination, we develop the conventional codebook with confidence functions. Similarities of both brightness and normalized color-vector are integrated confidence-weightedly to form overall similarity. A designed codeword-update progress also contributes to the stable performance. Besides, by introducing a membership function based measurement, the threshold of overall similarity is able to adjust itself with statistical properties of the given video. It makes the model rather robust. A thorough evaluation is performed on the Wallflower dataset. Qualitative and quantitative results and comparisons with other approaches justify the model.
منابع مشابه
An algorithm for determining common weights by concept of membership function
Data envelopment analysis (DEA) is a method to evaluate the relative efficiency of decision making units (DMUs). In this method, the issue has always been to determine a set of weights for each DMU which often caused many problems. Since the DEA models also have the multi-objective linear programming (MOLP) problems nature, a rational relationship can be established between MOLP and DEA problem...
متن کاملA proposed decision rule for speaker recognition based on fuzzy c-means clustering
In vector quantisation (VQ) based speaker recognition, the minimum overall average distortion rule is used as a criterion to assign a given sequence of acoustic vectors to a speaker model known as a codebook. An alternative decision rule based on fuzzy c-means clustering is proposed in this paper. A set of membership functions associated with vectors for codebooks are defined as discriminant fu...
متن کاملA comparative performance of gray level image thresholding using normalized graph cut based standard S membership function
In this research paper, we use a normalized graph cut measure as a thresholding principle to separate an object from the background based on the standard S membership function. The implementation of the proposed algorithm known as fuzzy normalized graph cut method. This proposed algorithm compared with the fuzzy entropy method [25], Kittler [11], Rosin [21], Sauvola [23] and Wolf [33] method. M...
متن کاملGeometric VLAD for Large Scale Image Search
We present a novel compact image descriptor for large scale image search. Our proposed descriptor Geometric VLAD (gVLAD) is an extension of VLAD (Vector of Locally Aggregated Descriptors) that incorporates weak geometry information into the VLAD framework. The proposed geometry cues are derived as a membership function over keypoint angles which contain evident and informative information but y...
متن کاملA New High-order Takagi-Sugeno Fuzzy Model Based on Deformed Linear Models
Amongst possible choices for identifying complicated processes for prediction, simulation, and approximation applications, high-order Takagi-Sugeno (TS) fuzzy models are fitting tools. Although they can construct models with rather high complexity, they are not as interpretable as first-order TS fuzzy models. In this paper, we first propose to use Deformed Linear Models (DLMs) in consequence pa...
متن کامل